The Basics of Metacomputation

ثبت نشده
چکیده

When we use the Refal machine for computation, we load a program into it, put the expression to evaluate into the view-field, and switch the machine on. The Refal machine works on its own; we do not interfere with its operation. After a while it comes up (or does not come up) with the desired (or not exactly desired) result. Metacomputation is an operation mode of the Refal machine where it is not left to itself, but is run under the supervision and control of a higher authority, which can be the user, i.e. a human being, or another machine. The purpose of this is to explore the behavior of the Refal machine with an initial view-field which is not completely defmed, but can be represented by an expression with free variables. The program is defmite and remaines fixed. The ultimate goal of metacomputation is to construct a formal model of the Refal machine working under these circumstances, a model which could serve as the machine's alternative defmition for that special case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Roadmap to Metacomputation by Supercompilation

This paper gives a gentle introduction to Turchin's super-compilation and its applications in metacomputation with an emphasis on recent developments. First, a complete supercompiler, including positive driving and generalization, is deened for a functional language and illustrated with examples. Then a taxonomy of related transformers is given and compared to the supercompiler. Finally, we put...

متن کامل

A Metacomputation Toolkit for a Subset of F] and Its Application to Software Testing Towards Metacomputation for the Masses

We present an on-going experiment to develop a practical metacomputation toolkit for F#. There are – apart from the better known supercompilation – other mature and potentially useful methods stemming from metacomputation theory: program inversion and tabulation, neighborhood analysis. Although implementations of these methods have existed since many years, they are typically experimental tools...

متن کامل

Metacomputation as a Tool for Formal Linguistic Modeling

We consider the principle “a new model is a model of an existing one” as the main scheme for deriving new linguistic models by metacomputation. We derive the basic requirements for metacomputation by a structural analysis of different model definitions, and show that in order to automate the creation of linguistic models the following operations on linguistic models have to be performed by meta...

متن کامل

Metasystem Transitions in Computer Science and Mathematics

We analyze MSTs, which may be observed, or are intentionally organized, in computer science and mathematics. These sciences are considered dealing with linguistic modeling. Various metasystems structures are revealed in activities of using the computer as a tool that makes linguistic models behaving by themselves, independently of their creator. The crucial role in automation of creating lingui...

متن کامل

Occam’s Razor in Metacomputation: the Notion of a Perfect Process Tree

We introduce the notion of a perfect process tree as a model for the full propagation of in formation in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompila tion which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled with a simple folding strategy is explain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011